#include <limits.h>
#include "graph.hh"
#include "construct_greedy_randomized_solution.hh"
#include "local_search_neighborhood_randomly.hh"
#include "local_search_key_path.hh"
#include "utilis.hh"
using namespace std;

int test_rsp(int argc, char *argv[])
{
	char * path_file_in = argv[1]; // Load from argv[]

	Graph * G = new Graph(path_file_in);

	cout << "G->GetKPathsBetween(): "<< endl;
	list<Path*> * paths = G->GetKPathsBetween(5, 4, 5, 3);
	for (list<Path*>::iterator it=paths->begin(); it != paths->end(); ++it)
	{
		cout << "PATH: "<< G->CostPath(*it) << endl;
		PrintPath(*it);
	}


	return 0;
}
